List of publications by Jan A

data types [1] J.A. Bergstra What is an abstract data type? Information Processing Letters, Vol. 7 1 (1978), p. 42-43. [2] J.A. Bergstra, M. Broy, J.V. Tucker and M. Wirsing. On the power of algebraic specifications . In J. Gruska and M. Chytil, eds. Proceedings of MFCS’81. Springer lecure Notes in Computer Science 118 (1981), p. 193-204. [3] J.A. Bergstra and J.-J. Ch. Meyer. Small specifications for large finite data structures. International J. of Computer Mathematics, Vol. 9 4 (1981), p. 305-320. [4] J.A. Bergstra and J.-J. Ch. Meyer. Equational specifications of finite minimal unoids, using unary hidden functions only. Fundamenta Informaticae, Vol. 5 2 (1982), p. 143-170. [5] J.A. Bergstra and J.-J. Ch. Meyer. A simple transfer lemma for abstract data type specifications. Information Processing Letters 14 2, p. 80-85. [6] J.A. Bergstra and J.W. Klop. Algebraic specifications for parametrized data types with minimal parameter and target algebras. In Proceedings of ICALP’82. Springer Lecture Notes in Computer Science 140 (1982), p. 23-34. [7] J.A. Bergstra and J.V. Tucker. The completeness of the algebraic specification methods for computable data types. Information and Control, Vol. 54 3 (1983), p. 186-200. [8] J.A. Bergstra and J.V. Tucker. Initial and final algebra semantics for data type specifications, two characterization theorems. SIAM J. of Computing, Vol. 12 2 (1983), p. 366-387. [9] J.A. Bergstra and J.W. Klop Initial algebra specifications for parametrized data types. Elektronische Informationsverarbeitung und Kybernetik 19 1/2 (1983), p. 17-31. [10] J.A. Bergstra and J.V. Tucker. Algebraic specifications of computable and semi-computable data structures. Theoretical Computer Science 50(1987), p. 137-181. [11] J.A. Bergstra and J. Heering. Which data types have ω-complete initial algebra specifications? Theoretical Computer Science, 124 (1994) p. 149–168. [12] J.A. Bergstra and J.Heering. Homomorphism preserving algebraic specifications require hidden sorts. Information and Computation, 119(1) (1995) p. 119–123.